Clique partitions and clique coverings
نویسندگان
چکیده
Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph . For a graph on n vertices, the clique partition number can grow cn z times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between en° vertices are deleted, Z--a < 1, then the number of cliques needed to partition what is left is asymptotic to c 2n~ ; this fills in a gap between results of Wallis for a < and Pullman and Donald for a =1, c > q . Clique coverings of a clique minus a matching are also investigated .
منابع مشابه
Clique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملOn Intersection Representations and Clique Partitions of Graphs
A multifamily set representation of a finite simple graph G is a multifamily F of sets (not necessarily distinct) for which each set represents a vertex in G and two sets in F intersects if and only if the two corresponding vertices are adjacent. For a graph G, an edge clique covering (edge clique partition, respectively) Q is a set of cliques for which every edge is contained in at least (exac...
متن کاملOn Greedy Clique Decompositions and Set Representations of Graphs
In 1994 S. McGuinness showed that any greedy clique decomposition of an n-vertex graph has at most ⌊n2/4⌋ cliques (The greedy clique decomposition of a graph, J. Graph Theory 18 (1994) 427-430), where a clique decomposition means a clique partition of the edge set and a greedy clique decomposition of a graph is obtained by removing maximal cliques from a graph one by one until the graph is empt...
متن کاملA characterisation of clique-width through nested partitions
Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set, using trees of nested partitions where partitions are ordered bottom-up by refinement. We show that the correspondences in both directions, between combinatorial partition trees and algebraic terms, pre...
متن کاملClique Coverings of Glued Graphs at Complete Clones
A clique covering of a graph G is a set of cliques of G in which each edge of G is contained in at least one clique. The smallest cardinality of clique coverings of G is called the clique covering number of G. A glued graph results from combining two nontrivial vertex-disjoint graphs by identifying nontrivial connected isomorphic subgraphs of both graphs. Such subgraphs are referred to as the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 72 شماره
صفحات -
تاریخ انتشار 1988